#include <iostream>
#include <vector>

using namespace std;

namespace {


// 二分查找
int BinSearch(vector<int> &array, int tar) {
    int left = 0;
    int right = array.size() - 1;

    while (left <= right) {
        int mid = left + (right - left) / 2;
        int num = array[mid];
        if (num == tar) {
            return mid;
        } else if (num < tar) {
            left = mid + 1;
        } else if (num > tar) {
            right = mid - 1;
        }
    }

    return -1;
}

// 快速排序

}